import javax.swing.tree.TreeNode;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();

        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.preOrderNor(root);
        System.out.println();



        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.inOrderNor(root);
        System.out.println();

        binaryTree.postOrder(root);
        System.out.println();


        /*System.out.println("总节点个数：" + binaryTree.size(root));
        System.out.println("叶子节点个数：" + binaryTree.getLeafNodeCount(root));
        System.out.println("第K层节点个数：" + binaryTree.getKLevelNodeCount(root, 3));
        System.out.println("二叉树的高度：" + binaryTree.getHeight(root));

        System.out.println("检测值为value的元素是否存在：" + binaryTree.find(root, 'Y'));

        System.out.print("层序遍历：");
        binaryTree.levelOrder(root);*/
    }
}
